Verifying Parameterized Networks usingAbstraction and Regular Languages ?
نویسندگان
چکیده
This paper describes a technique based on network grammars and abstraction to verify families of state-transition systems. The family of state-transition systems is represented by a context-free network grammar. Using the structure of the network grammar our technique constructs an invariant which simulates all the state-transition systems in the family. A novel idea used in this paper is to use regular languages to express state properties. We have implemented our techniques and veriied two non-trivial examples.
منابع مشابه
Permutation Rewriting and Algorithmic
We propose a natural subclass of regular languages (Alphabetic Pattern Constraints, APC) which is effectively closed under permutation rewriting, i.e., under iterative application of rules of the form ab ! ba. It is well-known that regular languages do not have this closure property, in general. Our result can be applied for example to regular model checking , for verifying properties of parame...
متن کاملÈöñùøøøøóò Êêûööøøòò Òò Ððóööøøññ Îöö¬ Blockin Blockinøøóò
Veri ation Ahmed Bouajjani, An a Mus holl, and Tayssir Touili LIAFA, Universit e Paris VII 2, pla e Jussieu, ase 7014 F-75251 Paris Cedex 05 e-mail: fAhmed.Bouajjani,An a.Mus holl,Tayssir.Touilig liafa.jussieu.fr Abstra t. We propose a natural sub lass of regular languages (Alphabeti Pattern Constraints, APC) whi h is e e tively losed under permutation rewriting, i.e., under iterative appli ati...
متن کاملBeyond Regular Model Checking
In recent years, it has been established that regular model checking can be successfully applied to several parameterized veriication problems. However, there are many parameterized veriication problems that cannot be described by regular languages, and thus cannot be veri-ed using regular model checking. In this study we try to practice symbolic model checking using classes of languages more e...
متن کاملFair Termination for Parameterized Probabilistic Concurrent Systems (Technical Report)
We consider the problem of automatically verifying that a parameterized family of probabilistic concurrent systems terminates with probability one for all instances against adversarial schedulers. A parameterized family defines an infinite-state system: for each number n, the family consists of an instance with n finite-state processes. In contrast to safety, the parameterized verification of l...
متن کاملFair Termination for Parameterized Probabilistic Concurrent Systems
We consider the problem of automatically verifying that a parameterized family of probabilistic concurrent systems terminates with probability one for all instances against adversarial schedulers. A parameterized family defines an infinite-state system: for each number n, the family consists of an instance with n finite-state processes. In contrast to safety, the parameterized verification of l...
متن کامل